On contact graphs of totally separable domains

Totally magic cordial labeling of some graphs

A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...

On embedding well-separable graphs

Call a simple graph H of order n well-separable, if by deleting a separator set of size o(n) the leftover will have components of size at most o(n). We prove, that bounded degree wellseparable spanning subgraphs are easy to embed: for every γ > 0 and positive integer ∆ there exists an n0 such that if n > n0, ∆(H) ≤ ∆ for a well-separable graph H of order n and δ(G) ≥ (1− 1 2(χ(H)−1) +γ)n for a ...

On separable self-complementary graphs

In this paper, we describe the structure of separable self-complementary graphs. c © 2002 Elsevier Science B.V. All rights reserved.

Signed Interval Logi on Totally Ordered Domains

totally magic cordial labeling of some graphs

a graph g is said to have a totally magic cordial labeling with constant c if there exists a mapping f : v (g) ∪ e(g) → {0, 1} such that f(a) + f(b) + f(ab) ≡ c (mod 2) for all ab ∈ e(g) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. in this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...